Experiments on Area Compaction Algorithms for Orthogonal Drawings
نویسندگان
چکیده
This paper presents an experimental study on several compaction algorithms for orthogonal drawings of graphs. We concentrate on algorithms that minimize the area, and compare them with other representative compaction algorithms in the state of the art. In particular, we propose a new exact algorithm that minimizes the total edge length subject to the optimization of the area, and experimentally prove that it is the best choice in many cases.
منابع مشابه
Orthogonal Compaction using Additional Bends
Compacting orthogonal drawings is a challenging task. Usually algorithms try to compute drawings with small area or edge length while preserving the underlying orthogonal shape. We present a onedimensional compaction algorithm that alters the orthogonal shape of edges for better geometric results. An experimental evaluation shows that we were able to reduce the total edge length and the drawing...
متن کاملCombining Graph Labeling and Compaction
Combinations of graph drawing and map labeling problems yield challenging mathematical problems and have direct applications, e.g., in automation engineering. We call graph drawing problems in which subsets of vertices and edges need to be labeled graph labeling problems. Unlike in map labeling where the position of the objects is specified in the input, the coordinates of vertices and edges in...
متن کاملInapproximability of Orthogonal Compaction
We show that several problems of compacting orthogonal graph drawings to use the minimum number of rows, area, length of longest edge or total edge length cannot be approximated better than within a polynomial factor of optimal in polynomial time unless P = NP. We also provide a fixed-parameter-tractable algorithm for testing whether a drawing can be compacted to a small number of rows. Submitt...
متن کاملAn Experimental Comparison of Orthogonal Compaction Algorithms
We present an experimental study in which we compare the state-of-the-art methods for compacting orthogonal graph layouts. Given the shape of a planar orthogonal drawing, the task is to place the vertices and the bends on grid points so that the total area or the total edge length is minimised. We compare four constructive heuristics based on rectangular dissection and on turn-regularity, also ...
متن کاملComputing Labeled Orthogonal Drawings
This paper studies the problem of computing labeled orthogonal drawings. A label is modeled as arectangle of prescribed size and it can be associated with either a vertex or an edge. Several additionaloptimization goals are taken into account. Namely, the labeled drawing can be required to have eitherminimum total edge length, or minimum width, or minimum height, or minimum area...
متن کامل